A condition number theorem for underdetermined polynomial systems
نویسنده
چکیده
The condition number of a numerical problem measures the sensitivity of the answer to small changes in the input. In their study of the complexity of Bézout’s theorem, M. Shub and S. Smale prove that the condition number of a polynomial system is equal to the inverse of the distance from this polynomial system to the nearest ill-conditioned one. Here we explain how this result can be extended to underdetermined systems of polynomials (that is with less equations than unknowns).
منابع مشابه
ON CONVERGENCE THEOREMS FOR FUZZY HENSTOCK INTEGRALS
The main purpose of this paper is to establish different types of convergence theorems for fuzzy Henstock integrable functions, introduced by Wu and Gong cite{wu:hiff}. In fact, we have proved fuzzy uniform convergence theorem, convergence theorem for fuzzy uniform Henstock integrable functions and fuzzy monotone convergence theorem. Finally, a necessary and sufficient condition under which th...
متن کاملExistence of Solutions to Systems of Underdetermined Equations and Spherical Designs
This paper is concerned with proving the existence of solutions to an underdetermined system of equations and with the application to existence of spherical t-designs with (t+ 1)2 points on the unit sphere S2 in R3. We show that the construction of spherical designs is equivalent to solution of underdetermined equations. A new verification method for underdetermined equations is derived using B...
متن کاملA Numerical Algorithm for Zero Counting. II: Distance to Ill-posedness and Smoothed Analysis
We show a Condition Number Theorem for the condition number of zero counting for real polynomial systems. That is, we show that this condition number equals the inverse of the normalized distance to the set of ill-posed systems (i.e., those having multiple real zeros). As a consequence, a smoothed analysis of this condition number follows.
متن کاملOn the Expected Number of Real Roots of a System of Random Polynomial Equations
We unify and generalize several known results about systems of random polynomials. We first classify all orthogonally invariant normal measures for spaces of polynomial mappings. For each such measure we calculate the expected number of real zeros. The results for invariant measures extend to underdetermined systems, giving the expected volume for orthogonally invariant random real projective v...
متن کاملRational Solutions of Underdetermined Polynomial Equations
In this paper we report on an application of computer algebra in which mathematical puzzles are generated of a type that had been widely used in mathematics contests by a large number of participants worldwide. The algorithmic aspect of our work provides a method to compute rational solutions of single polynomial equations that are typically large with 10 . . . 10 terms and that are heavily und...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Comput.
دوره 70 شماره
صفحات -
تاریخ انتشار 2001